package binary_search;

public class takeAttendance {
    public int takeAttendance(int[] records) {
        int left = 0;
        int right = records.length - 1;
        int mid = 0;
        while(left < right) {
            mid = left + (right - left)/2;
            if(records[mid] != mid){
                right = mid;
            }else {
                left = mid+1;
            }
        }
        return left == records[left] ? left+1:left ;

    }
}
